Artificial Catalytic Reactions in 2D for Combinatorial Optimization
نویسنده
چکیده
Presented in this paper is a derivation of a 2D catalytic reaction-based model to solve combinatorial optimization problems (COPs). The simulated catalytic reactions, a computational metaphor, occurs in an artificial chemical reactor that finds near-optimal solutions to COPs. The artificial environment is governed by catalytic reactions that can alter the structure of artificial molecular elements. Altering the molecular structure means finding new solutions to the COP. The molecular mass of the elements was considered as a measure of goodness of fit of the solutions. Several data structures and matrices were used to record the directions and locations of the molecules. These provided the model the 2D topology. The Traveling Salesperson Problem (TSP) was used as a working example. The performance of the model in finding a solution for the TSP was compared to the performance of a topology-less model. Experimental results show that the 2D model performs better than the topology-less one.
منابع مشابه
A new metaheuristic genetic-based placement algorithm for 2D strip packing
Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...
متن کاملTOPOLOGY OPTIMIZATION OF 2D BUILDING FRAMES UNDER ARTIFICIAL EARTHQUAKE GROUND MOTIONS USING POLYGONAL FINITE ELEMENT METHOD
In this article, topology optimization of two-dimensional (2D) building frames subjected to seismic loading is performed using the polygonal finite element method. Artificial ground motion accelerograms compatible with the design response spectrum of ASCE 7-16 are generated for the response history dynamic analysis needed in the optimization. The mean compliance of structure is minimized as a t...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملModified particle swarm optimization algorithm to solve location problems on urban transportation networks (Case study: Locating traffic police kiosks)
Nowadays, traffic congestion is a big problem in metropolises all around the world. Traffic problems rise with the rise of population and slow growth of urban transportation systems. Car accidents or population concentration in particular places due to urban events can cause traffic congestions. Such traffic problems require the direct involvement of the traffic police, and it is urgent for the...
متن کاملDetermination of Suitable Operating Conditions of Fluid Catalytic Cracking Process by Application of Artificial Neural Network and Firefly Algorithm
Fluid Catalytic Cracking (FCC) process is a vital unit to produce gasoline. In this research, a feed forward ANN model was developed and trained with industrial data to investigate the effect of operating variables containing reactor temperature feed flow rate, the temperature of the top of the main column and the temperature of the bottom of the debutanizer tower on quality and quantity of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1506.09019 شماره
صفحات -
تاریخ انتشار 2015